RimJump: Edge-based Shortest Path Planning for a 2D Map

Approximation Algorithms for Shortest Path Motion Planning

This paper gives approximation algorithms for solving the following motion planning problem: Given a set of polyhedral obstacles and points s and t, find a shortest path from s to t that avoids the obstacles. The paths found by the algorithms are piecewise linear, and the length of a path is the sum of the lengths of the line segments making up the path. Approximation algorithms will be given f...

Direction Weighted Shortest Path Planning

Row/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips

In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...

Affordance-Map : A Map for Context-Aware Path Planning

‘Context-awareness’ could be one of the most desired fundamental abilities that a robot should have when sharing a workspace with humans co-workers. Arguably, a robot with appropriate context-awareness could lead to a better human robot interaction. In this paper, we address the problem of combining contextawareness with robotic path planning. Our approach is based on affordance-map, which invo...

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...